Local vs. Global Optimization: Operator Placement Strategies in Heterogeneous Environments

نویسندگان

  • Tomas Karnagel
  • Dirk Habich
  • Wolfgang Lehner
چکیده

In several parts of query optimization, like join enumeration or physical operator selection, there is always the question of how much optimization is needed and how large the performance benefits are. In particular, a decision for either global optimization (e.g., during query optimization) or local optimization (during query execution) has to be taken. In this way, heterogeneity in the hardware environment is adding a further optimization aspect while it is yet unknown, how much optimization is actually required for that aspect. Generally, several papers have shown that heterogeneous hardware environments can be used e ciently by applying operator placement for OLAP queries. However, whether it is better to apply this placement in a local or global optimization strategy is still an open question. To tackle this challenge, we examine both strategies for a column-store database system in this paper. Aside from describing local and global placement in detail, we conduct an exhaustive evaluation to draw some conclusions. For the global placement strategy, we also propose a novel approach to address the challenge of an exploding search space together with discussing wellknown solutions for improving cardinality estimation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments

Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...

متن کامل

Augmented Downhill Simplex a Modified Heuristic Optimization Method

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

متن کامل

Fluid Injection Optimization Using Modified Global Dynamic Harmony Search

One of the mostly used enhanced oil recovery methods is the injection of water or gas under pressure to maintain or reverse the declining pressure in a reservoir. Several parameters should be optimized in a fluid injection process. The usual optimizing methods evaluate several scenarios to find the best solution. Since it is required to run the reservoir simulator hundreds of times, the process...

متن کامل

Empirical Study of Particle Swarm Optimization Mutation Operators

Particle Swarm Optimization (PSO) is a global optimization algorithm for real valued problems. One of the known positive traits of the algorithm is fast convergence. While this is considered a good thing because it means the solutions are found faster it can lead to stagnation at a local minimum. There are several strategies to circumvent this. One of them is the use of mutation operators to in...

متن کامل

Economic Evaluation of Optimal Capacitor Placement in Reconfiguration Distribution System Using Genetic Algorithm

Optimal capacitor placement, considering power system loss reduction, voltage profile improvement, line reactive power decrease and power factor correction, is of particular importance in power system planning and control. The distribution system operator calculates the optimal place, number and capacity of capacitors based on two major purposes: active power loss reduction and return on invest...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015